A Note on the Complexity of P - Matrix LCP and Computingan
نویسنده
چکیده
It is proved that if it is NP-hard to solve the linear complemen-tarity problemwith P-matrix or to compute a Nash-equilibrium point in a 2-player game, then NP = coNP.
منابع مشابه
A Note on the Complexity of P Matrix LCP and Computing an Equilibrium
It is proved that if it is NP hard to solve the linear complemen tarity problemwith P matrix or to compute a Nash equilibrium point in a player game then NP coNP
متن کاملCorrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path
In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...
متن کاملCLS: New Problems and Completeness
The complexity class CLS was introduced by Daskalakis and Papadimitriou in [9] with the goal of capturing the complexity of some well-known problems in PPAD ∩ PLS that have resisted, in some cases for decades, attempts to put them in polynomial time. No complete problem was known for CLS, and in [9], the problems Contraction, i.e., the problem of finding an approximate fixpoint of a contraction...
متن کاملThe Complexity of Continuous Local Search By
The complexity class CLS was introduced by Daskalakis and Papadimitriou in [9] with the goal of capturing the complexity of some well-known problems in PPAD∩PLS that have resisted, in some cases for decades, attempts to put them in polynomial time. No complete problem was known for CLS, and in [9], the problems CONTRACTION, i.e., the problem of finding an approximate fixpoint of a contraction m...
متن کاملA Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
A large-step infeasible-interior-point method is proposed for solving P∗(κ)-matrix linear complementarity problems. It is new even for monotone LCP. The algorithm generates points in a large neighborhood of an infeasible central path. Each iteration requires only one matrix factorization. If the problem is solvable, then the algorithm converges from arbitrary positive starting points. The compu...
متن کامل